Eigenvector-like measures of centrality for asymmetric relations
نویسندگان
چکیده
Eigenvectors of adjacency matrices are useful as measures of centrality or of status. However, they are misapplied to asymmetric networks in which some positions are unchosen. For these networks, an alternative measure of centrality is suggested that equals an eigenvector when eigenvectors can be used and provides meaningfully comparable results when they cannot. © 2001 Elsevier Science B.V. All rights reserved. JEL classification: C00 General mathematical and quantitative methods
منابع مشابه
Handling Weighted, Asymmetric, Self-Looped, and Disconnected Networks in ORA
When Linton C. Freeman made his conceptual clarifications about centrality measures in social network analysis in 1979 he exclusively focused on unweighted, symmetric, and connected networks without the possibility of self-loops. Even though a lot of articles have been published in the last years discussing network measures for weighted, asymmetric or unconnected networks, the vast majority of ...
متن کاملSome unique properties of eigenvector centrality
Eigenvectors, and the related centrality measure Bonacich’s c(β), have advantages over graph-theoretic measures like degree, betweenness, and closeness centrality: they can be used in signed and valued graphs and the beta parameter in c(β) permits the calculation of power measures for a wider variety of types of exchange. Degree, betweenness, and closeness centralities are defined only for clas...
متن کاملEigenvector-centrality - a node-centrality?
Networks of social relations can be represented by graphs and socioor adjacency-matrices and their structure can be analyzed using different concepts, one of them called centrality. We will provide a new formalization of a “node-centrality” which leads to some properties a measure of centrality has to satisfy. These properties allow to test given measures, for example measures based on degree, ...
متن کاملCorrelation of Eigenvector Centrality to Other Centrality Measures: Random, Small-world and Real-world Networks
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality measures, including degree centrality, betweenness centrality, clustering coefficient centrality, closeness centrality, and farness centrality, of various types of network (random network, smallworld network, and real-world network). For each network, we compute those six centrality measures, from...
متن کاملSinkless: A Preliminary Study of Stress Propagation in Group Project Social Networks using a Variant of the Abelian Sandpile Model
We perform social network analysis on 53 students split over three semesters and 13 groups, using conventional measures like eigenvector centrality, betweeness centrality, and degree centrality, as well as defining a variant of the Abelian Sandpile Model (ASM) with the intention of modeling stress propagation in the college classroom. We correlate the results of these analyses with group projec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Networks
دوره 23 شماره
صفحات -
تاریخ انتشار 2001